Real Multiplication Revisited

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Double-base scalar multiplication revisited

This paper reduces the number of field multiplications required for scalar multiplication on conservative elliptic curves. For an average 256-bit integer n, this paper’s multiply-by-n algorithm takes just 7.47M per bit on twisted Edwards curves −x + y = 1 + dxy with small d. The previous record, 7.62M per bit, was unbeaten for seven years. Unlike previous record-setting algorithms, this paper’s...

متن کامل

Multiplication in Sobolev Spaces, Revisited

In this article, we re-examine some of the classical pointwise multiplication theorems in Sobolev-Slobodeckij spaces, and along the way we cite a simple counterexample that illustrates how certain multiplication theorems fail in Sobolev-Slobodeckij spaces when a bounded domain is replaced by R. We identify the source of the failure, and examine why the same failure is not encountered in Bessel ...

متن کامل

Real Multiplication and . . .

Classical theory of Complex Multiplication (CM) shows that all abelian extensions of a complex quadratic field K are generated by the values of appropriate modular functions at the points of finite order of elliptic curves whose endomorphism rings are orders in K. For real quadratic fields, a similar description is not known. However, the relevant (still unproved) case of Stark conjectures ([St...

متن کامل

Montgomery Modular Multiplication on ARM-NEON Revisited

Montgomery modular multiplication constitutes the “arithmetic foundation” of modern public-key cryptography with applications ranging from RSA, DSA and Diffie-Hellman over elliptic curve schemes to pairing-based cryptosystems. The increased prevalence of SIMD-type instructions in commodity processors (e.g. Intel SSE, ARM NEON) has initiated a massive body of research on vector-parallel implemen...

متن کامل

Quantum Computation and Real Multiplication

We propose a construction of anyon systems associated to quantum tori with real multiplication and the embedding of quantum tori in AF algebras. These systems generalize the Fibonacci anyons, with weaker categorical properties, and are obtained from the basic modules and the real multiplication structure.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Generalized Lie Theory and Applications

سال: 2016

ISSN: 1736-4337

DOI: 10.4172/1736-4337.1000s2-007